Upward planar drawings on the standing and the rolling cylinders
نویسندگان
چکیده
منابع مشابه
On the Curve Complexity of Upward Planar Drawings
We consider directed graphs with an upward planar drawing on the plane, the sphere, the standing and the rolling cylinders. In general, the drawings allow complex curves for the edges with many zig-zags and windings around the cylinder and the sphere. The drawings are simplified to polyline drawings with geodesics as straight segments and vertices and bends at grid points. On the standing cylin...
متن کاملThe Duals of Upward Planar Graphs on Cylinders
We consider directed planar graphs with an upward planar drawing on the rolling and standing cylinders. These classes extend the upward planar graphs in the plane. Here, we address the dual graphs. Our main result is a combinatorial characterization of these sets of upward planar graphs. It basically shows that the roles of the standing and the rolling cylinders are interchanged for their duals.
متن کاملUpward Planar Drawings and Switch-regularity Heuristics
In this paper we present a new characterization of switch-regular upward embeddings, a concept introduced by Di Battista and Liotta in 1998. This characterization allows us to define a new efficient algorithm for computing upward planar drawings of embedded planar digraphs. If compared with a popular approach described by Bertolazzi, Di Battista, Liotta, and Mannino, our algorithm computes draw...
متن کاملUniversal Slope Sets for Upward Planar Drawings
We prove that every set S of ∆ slopes containing the horizontal slope is universal for 1-bend upward planar drawings of bitonic st-graphs with maximum vertex degree ∆, i.e., every such digraph admits a 1-bend upward planar drawing whose edge segments use only slopes in S. This result is worst-case optimal in terms of the number of slopes, and, for a suitable choice of S, it gives rise to drawin...
متن کاملPlanar upward tree drawings with optimal area
Rooted trees are usually drawn planar and upward i e without crossings and with out any parent placed below its child In this paper we investigate the area requirement of planar upward drawings of rooted trees We give tight upper and lower bounds on the area of various types of drawings and provide linear time algorithms for constructing optimal area drawings Let T be a bounded degree rooted tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2014
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2013.08.003